ISRO CSE 2016


Q51.

Working Set (t,k) at an instant of time t is
GateOverflow

Q52.

Dynamic routing protocol enable routers to
GateOverflow

Q53.

Which network protocol allows hosts to dynamically get a unique IP number on each bootup
GateOverflow

Q54.

The address of a class B host is to be split into subnets with a 6-bit subnet number. What is the maximum number of subnets and the maximum number of hosts in each subnet?
GateOverflow

Q55.

Consider the following recurrence:T(n)=2T\left ( \sqrt{n}\right )+1, T(1)=1Which one of the following is true?
GateOverflow

Q56.

If L and \bar L are recursively enumerable then L is
GateOverflow

Q57.

Consider the join of a relation R with a relation S. If R has m tuples and S has n tuples then the maximum and minimum sizes of the join respectively are
GateOverflow

Q58.

Given the relations employee (name, salary, dept-no), and department (dept-no, dept-name,address), Which of the following queries cannot be expressed using the basic relational algebra operations \left(\sigma, \pi,\times ,\Join, \cup, \cap,-\right)?
GateOverflow

Q59.

What is the highest type number that can be assigned to the following grammar?S \rightarrow A a, A \rightarrow B a, B \rightarrow a b c
GateOverflow

Q60.

Goals for the design of the logical scheme include
GateOverflow